k-Path Partitions in Trees
نویسندگان
چکیده
For a fixed positive integer k, the k-path partition problem is to partition the vertex set of a graph into the smallest number of paths such that each path has at most k vertices. The 2path partition problem is equivalent to the edge-cover problem. This paper presents a linear-time algorithm for the k-path partition problem in trees. The algorithm is applicable to the problem of finding the minimum number of message originators necessary to broadcast a message to all vertices in a tree network in one or two time units.
منابع مشابه
k-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملOptimal Mesh Computer Algorithms for Simple Polygons
We present optimal parallel algorithms that run in O(p n) time on a p n p n mesh-connected computer for a number of fundamental problems concerning visibility and distance properties inside a simple polygon. These include computing shortest paths, shortest path trees, shortest path partitions, all-farthest neighbors (both internal and external), the visibility polygon of a point, the weak visib...
متن کاملEnumeration of 1- and 2-crossing Partitions with Refinements
An enumeration of the 1-crossing partitions of [n] into k blocks by bijection with ordered trees with n edges, k internal nodes, and root degree j = 4 is presented. A semi-bijection of these ordered trees to Dyck paths of semilength n, k peaks, and j = 4 last peak height is used to derive a conjectured formula for the number of 1-crossing partitions of [n] with k blocks. We also explore some na...
متن کاملAsymptotic behaviour of associated primes of monomial ideals with combinatorial applications
Let $R$ be a commutative Noetherian ring and $I$ be an ideal of $R$. We say that $I$ satisfies the persistence property if $mathrm{Ass}_R(R/I^k)subseteq mathrm{Ass}_R(R/I^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{Ass}_R(R/I)$ denotes the set of associated prime ideals of $I$. In this paper, we introduce a class of square-free monomial ideals in the polynomial ring $R=K[x_1,ld...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 78 شماره
صفحات -
تاریخ انتشار 1997